<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    213. House Robber II
   </h1>
   <p>
    You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are
    <strong>
     arranged in a circle.
    </strong>
    That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have security system connected and&nbsp;
    <b>
     it will automatically contact the police if two adjacent houses were broken into on the same night
    </b>
    .
   </p>
   <p>
    Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight
    <strong>
     without alerting the police
    </strong>
    .
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [2,3,2]
<strong>Output:</strong> 3
<strong>Explanation:</strong> You cannot rob house 1 (money = 2) and then rob house 3 (money = 2),
&nbsp;            because they are adjacent houses.
</pre>
   <p>
    <strong>
     Example 2:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [1,2,3,1]
<strong>Output:</strong> 4
<strong>Explanation:</strong> Rob house 1 (money = 1) and then rob house 3 (money = 3).
&nbsp;            Total amount you can rob = 1 + 3 = 4.</pre>
  </div>
  <div>
   <h1 class="question_title">
    213. 打家劫舍 II
   </h1>
   <p>
    你是一个专业的小偷，计划偷窃沿街的房屋，每间房内都藏有一定的现金。这个地方所有的房屋都
    <strong>
     围成一圈，
    </strong>
    这意味着第一个房屋和最后一个房屋是紧挨着的。同时，相邻的房屋装有相互连通的防盗系统，
    <strong>
     如果两间相邻的房屋在同一晚上被小偷闯入，系统会自动报警
    </strong>
    。
   </p>
   <p>
    给定一个代表每个房屋存放金额的非负整数数组，计算你
    <strong>
     在不触动警报装置的情况下，
    </strong>
    能够偷窃到的最高金额。
   </p>
   <p>
    <strong>
     示例&nbsp;1:
    </strong>
   </p>
   <pre><strong>输入:</strong> [2,3,2]
<strong>输出:</strong> 3
<strong>解释:</strong> 你不能先偷窃 1 号房屋（金额 = 2），然后偷窃 3 号房屋（金额 = 2）, 因为他们是相邻的。
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> [1,2,3,1]
<strong>输出:</strong> 4
<strong>解释:</strong> 你可以先偷窃 1 号房屋（金额 = 1），然后偷窃 3 号房屋（金额 = 3）。
&nbsp;    偷窃到的最高金额 = 1 + 3 = 4 。</pre>
  </div>
 </body>
</html>